Getting DNA copy numbers without control samples
نویسندگان
چکیده
منابع مشابه
Getting Rid Of Numbers DOP without Probability Theory?
Probabilistic context free grammars (PCFGs) and similar models make use of probability theory and therefore depend on numeric calculations. In particular, the Data-Oriented-Parsing (DOP) model from [1] uses the relative probability of subtrees to determine preferred derivations and thereby preferred trees for given sentences. This motivates criticism of its cognitive realism from both philosoph...
متن کاملJoint Analysis of DNA Copy Numbers and Gene Expression Levels
Genomic instabilities, amplifications, deletions and translocations are often observed in tumor cells. In the process of cancer pathogenesis cells acquire multiple genomic alterations, some of which drive the process by triggering overexpression of oncogenes and by silencing tumor suppressors and DNA repair genes. We present data analysis methods designed to study the overall transcriptional ef...
متن کاملCopy numbers count for autism
Mind image: Autism is characterized by a triad of impairments to social behaviour, communication and imagination. One school of thought claims that individuals with autism lack a ‘theory of mind’, implying that they don’t have a concept of themselves and other people as distinct, thinking personalities with their own beliefs, desires, etc. (Photo: N.H. Gross.) Autism, a neurodevelopmental disor...
متن کاملStatistical correlation between enterovirus genome copy numbers and infectious viral particles in wastewater samples.
AIMS Classic virological tests are time consuming and labour-intensive; real-time RT-PCR has proven to be a fast method to detect and quantify enterovirus genomes in clinical and environmental samples. This method is unable to discriminate between infective and noninfective enterovirus particles; few clinical studies have compared real-time RT-PCR and viral culture. We wondered if the enterovir...
متن کاملGetting Close without Touching
In this paper we study the Near-Gathering problem for a set of asynchronous, anonymous, oblivious and autonomous mobile robots with limited visibility moving in LookCompute-Move (LCM) cycles: In this problem, the robots have to get close enough to each other, so that every robot can see all the others, without touching (i.e., colliding) with any other robot. The importance of this problem might...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2012
ISSN: 1748-7188
DOI: 10.1186/1748-7188-7-19